Hamiltonian graph
英
美
网络 哈密顿图; 汉密尔顿图; 哈密尔顿图; 哈米尔顿图
双语例句
- This paper discusses the application of degree in other aspects of graph theory, such as cycle, Hamiltonian graph and matching on the base of reference.
在已有文献的基础上，讨论度在图论其它方面，诸如在圈、哈密顿图、匹配中的应用。 - Condition on existence of Hamiltonian factor in balanced bipartite graph
均衡二分图中存在哈密顿因子的条件 - In this paper the study of the algorithm which has been done by the author for generating all the Hamiltonian cycles in a graph by a method of Wang algebra is continued.
作者曾提出利用王氏代数产生图的全部哈密顿圈，本文继续研究了这种算法。 - Hamiltonian property in the square of a connected graph
平方图的汉米尔顿性 - Generation of All Hamiltonian Cycles in a Plane Graph
平面化图的哈密顿圈的产生 - A Result on Hamiltonian Line Graph
关于Hamltion线图的一个结果 - A New Method of Judgement of a Hamiltonian Graph
判别哈密尔顿图的新方法 - The Toughness and Hamiltonian Circuits of Graph
图的坚韧度与哈密尔顿圈 - This paper is to show how a modified Wang product can be used to generate all the Hamiltonian cycles in a plane graph with considerably less computation than previousely reported.
本文提出如何利用修正的王氏积产生平面化图的全部哈密顿圈。 - On Hamiltonian Cycle in Line Graph
线图中的哈密顿圈 - The Problem of Hamiltonian Cycles on Spreading graph in the DES
DES中关于扩散图的哈密顿环问题 - On the Number of Hamiltonian Cycles in m-regular Graph of order 2m+ 1
2m+1个顶点的m正则图中哈密尔顿回路数 - On Hamiltonian Line Graph in K_3-Free Graph
不含K3图的线图的哈密顿性 - In term of the literature 1 a new algorithm for finding all undirected Hamiltonian circuits in an undirected graph is presented in this paper.
本文在文献的基础之上，证明了一种可求得无向图中全部哈密顿回路的新算法。 - A planarity testing algorithm of Hamiltonian graph
哈密顿平面图的一个判定算法 - This paper presents a polynomial algorithm to determine whether a threshold graph is a Hamiltonian graph. It is also shown that STEINER tree problem in threshold graph is NP-complete and a polynomial approximate algorithm for it is proposed.
本文给出了判定阈图是否为哈密顿图的多项式时间算法，并证明了阈图上STEINER树问题是NP-完全的，给出解答它的多项式时间近似算法。 - In order to find out all Hamiltonian tours of a graph, this paper puts forward the concepts about H sets, H matrices joining product and path matrix, etc.
为求出图的全部哈密顿回路，本文提出了H集合、连接积、H矩阵和通路矩阵等概念。 - The degree sequence of Hamiltonian graph of not containing k~ 3
不含K~3的哈密顿图的次序列 - A new algorithm for outputing All Hamiltonian circuits of a graph or digraph
输出图的全部Hamiltonian回路的新算法 - Enumeration of All Hamiltonian Circuits in A Graph
产生图的全部哈密顿回路 - Induced subgraph and Hamiltonian property of graph
生成子图与图的哈密顿性质